Random preorders and alignments
نویسندگان
چکیده
منابع مشابه
Random preorders and alignments
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a random preorder chosen uniformly at random among all preorders on n elements, and also the distribution of cycles in a random alignment chosen uniformly at random among all alignments on n elements, as n →∞.
متن کاملRandom preorders
A random preorder on n elements consists of linearly ordered equivalence classes called blocks. We investigate the block structure of a preorder chosen uniformly at random from all preorders on n elements as n→ ∞.
متن کاملType Preorders and Recursive Terms
We show how to use intersection types for building models of a λ-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result.
متن کاملMultiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...
متن کاملCompliance and Testing Preorders Differ
Contracts play an essential role in the Service Oriented Computing, for which they need to be equiped with a sub-contract relation. We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy. We show that if the language of contracts is sufficiently expressive then the resulting subcontract relations are incomparable. However if w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.04.021